Logical Form andthe Vernacular

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Systolic Tree ! - Languages : The Operational andthe Logical

The class of !-languages recognized by systolic (binary) tree automata is introduced. That class extends the class of B uchi !-languages though maintaining the closure under union, intersection and complement and the decidability of emptiness. The class of systolic tree !-languages is characterized in terms of a (suitable) concatenation of ((nitary) systolic tree languages. A generalization of ...

متن کامل

Logical Form

The notion of the logical form of an expression E is shown to be a semantic notion that can be derived from the notion of the structured meaning of E. This simple idea can be traced to categorial grammars, and it is implicitly used by Richard Montague. We argue that a most fine-grained tool for defining structured meaning can be found in Pavel Tichý’s Transparent Intensional Logic (TIL). Struct...

متن کامل

Deforesting Logical Form

This paper argues against Logical Form (LF) as an intermediate level of representation in language processing. We apply a program transformation technique called deforestation to demonstrate the inessentiality of LF in a parsing system that builds semantic interpretations. We consider two phenomena, Quantifier Raising in English and Wh-movement in Chinese, which have played key roles in the bro...

متن کامل

AgAinst logicAl form

An old view in logic going back to Aristotle is that an inference is valid in virtue of its logical form. Many psychologists have adopted the same point of view about human reasoning: the first step is to recover the logical form of an inference, and the second step is to apply rules of inference that match these forms in order to prove that the conclusion follows from the premises. The present...

متن کامل

Subtyping in Logical Form

By using intersection types and filter models we formulate a theory of types for a λ-calculus with record subtyping via a finitary programming logic. Types are interpreted as spaces of filters over a subset of the language of properties (the intersection types) which describes the underlying type free realizability structure. We show that such an interpretation is a PER semantics, proving that ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mind and Language

سال: 2001

ISSN: 0268-1064,1468-0017

DOI: 10.1111/1468-0017.00177